On the F2-linear relations of Mersenne Twister pseudorandom number generators

نویسنده

  • Shin Harase
چکیده

Sequence generators obtained by linear recursions over the two-element field F2, i.e., F2-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the most successful applications. An advantage of such generators is that we can assess them quickly by using theoretical criteria, such as the dimension of equidistribution with v-bit accuracy. To compute these dimensions, several polynomial-time lattice reduction algorithms have been proposed in the case of F2-linear generators. In this paper, in order to assess non-random bit patterns in dimensions that are higher than the dimension of equidistribution with v-bit accuracy, we focus on the relationship between points in the Couture–L’Ecuyer dual lattices and F2-linear relations on the most significant v bits of output sequences, and consider a new figure of merit Nv based on the minimum weight of F2-linear relations whose degrees are minimal for v. Next, we numerically show that MT19937 has low-weight F2-linear relations in dimensions higher than 623, and show that some output vectors with specific lags are rejected or have small p-values in birthday spacings tests. We also report that some variants of Mersenne Twister, such as WELL generators, are significantly improved from the perspective of Nv.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast lattice reduction for F2-linear pseudorandom number generators

Sequences generated by an F2-linear recursion have wide applications, in particular, pseudorandom number generation. The dimension of equidistribution with v-bit accuracy is a most important criterion for the uniformity of the generated sequence. The fastest known method for computing these dimensions is proposed by Couture and L’Ecuyer, based on Lenstra’s lattice basis reduction and the dual l...

متن کامل

Pseudorandom Number Generation: Impossibility and Compromise

Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudorandom number generators such as the Mersenne Twister are freely avail-

متن کامل

Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units

Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is fo...

متن کامل

Re-seeding invalidates tests of random number generators

Kim et al (Appl Math & Comput 199 (2008) 195) recently presented a test of random number generators based on the gambler’s ruin problem and concluded that several generators, including the widely used Mersenne Twister, have hidden defects. We show here that the test by Kim et al suffers from a subtle, but consequential error: Re-seeding the pseudorandom number generator with a fixed seed for ea...

متن کامل

SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator

Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a long period of 2 − 1, designed 10 years ago based on 32-bit operations. In this decade, CPUs for personal computers have acquired new features, such as Single Instruction Multiple Data (SIMD) operations (i.e., 128bit operations) and multi-stage pipelines. Here we propose a 128-bit based PRNG, named SIMD-orie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 100  شماره 

صفحات  -

تاریخ انتشار 2014